Probabilistic Algorithms for Defeating Adversaries
نویسندگان
چکیده
منابع مشابه
Distributed pursuit algorithms for probabilistic adversaries on connected graphs
A gambler moves between the vertices 1, . . . , n of a graph using the probability distribution p1, . . . , pn. Multiple cops pursue the gambler on the graph, only being able to move between adjacent vertices. We investigate the expected capture time for the gambler against k cops as a function of n and k for three versions of the game: • known gambler: the cops know the gambler’s distribution ...
متن کاملDecision Algorithms for Probabilistic Bisimulation
We propose decision algorithms for bisimulation relations defined on probabilistic automata, a model for concurrent nondeterministic systems with randomization. The algorithms decide both strong and weak bisimulation relations based on deterministic as well as randomized schedulers. These algorithms extend and complete other known algorithms for simpler relations and models. The algorithm we pr...
متن کاملApproximation Algorithms for Probabilistic Decoding
It was recently shown that the problem of decoding messages transmitted through a noisy channel can be formulated as a belief updating task over a probabilistic network [13]. Moreover, it was observed that iterative application of the (linear time) belief propagation algorithm designed for polytrees [14] outperformed state of the art decoding algorithms, even though the corresponding networks m...
متن کاملOn Expected Probabilistic Polynomial-Time Adversaries: A suggestion for restricted de nitions and their bene ts
This paper concerns the possibility of developing a coherent theory of security when feasibility is associated with expected probabilistic polynomial-time (expected PPT). The source of diiculty is that the known deenitions of expected PPT strategies (i.e., expected PPT interactive machines) do not support natural results of the type presented below. To overcome this diiculty, we suggest new dee...
متن کاملAn anti-incursion algorithm for unknown probabilistic adversaries on connected graphs
A gambler moves on the vertices 1, . . . , n of a graph using the probability distribution p1, . . . , pn. A cop pursues the gambler on the graph, only being able to move between adjacent vertices. What is the expected number of moves that the gambler can make until the cop catches them? Komarov and Winkler proved an upper bound of approximately 1.97n for the expected capture time on any connec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistical Science
سال: 1993
ISSN: 0883-4237
DOI: 10.1214/ss/1177011080